Two 4-valued implicative expansions of first-degree entailment logic: The relevant logic BN4VSP and the (relevant) entailment logic BN4AP
نویسندگان
چکیده
Abstract A logic L has the ‘variable-sharing property’ (VSP) if in all L-theorems of form $A\rightarrow B$, $A$ and $B$ share at least a propositional variable. ‘Ackermann (AP) (B\rightarrow C)$, contains conditional connective ($\rightarrow $). Anderson Belnap consider VSP necessary property any relevant logic, both AP properties (relevant) entailment logic. Now, among logicians, Brady’s BN4 is widely viewed as adequate 4-valued implicative But lacks AP. The aim this paper to define logics BN4$^{\text {VSP}}$ {AP}}$. former one VSP, whereas latter Moreover, have some that do not support their consideration mere artificial constructs.
منابع مشابه
Negation in the Logic of First Degree Entailment and Tonk
The dialogical framework is an approach to meaning that provides an alternative to both the model-theoretical and the proof-theoretical semantics. The dialogical approach to logic is not a logic but a semantic rule-based framework where different logics could be developed, combined or compared. But are there any constraints? Can we introduce rules ad libitum to define whatever logical constant?...
متن کاملThe first axiomatization of relevant logic
This is a review. with historical and critical comments, of a paper b) I. E. Orlov from 1928, which eivcs the oldest known axiomatization of the implicationnegation fragment of the rclcvant logic R. Orlov’s paper also l’omshadow the modal translation of systems with an intuitionistic negation into %-type extensions of systems with a classical. involutive. negation. Orlov introduces the modal po...
متن کاملFuzzy attribute logic: syntactic entailment and completeness
Fuzzy attribute implications are particular if-then rules which can be extracted from data tables with fuzzy attributes. We develop fuzzy attribute logic (FAL), its syntax, semantics, and prove a classical as well as Pavelka-style completeness theorem for FAL. Also, we present relationships to completeness of sets of attribute implications w.r.t. data tables. Because of the limited scope of the...
متن کاملLogic of approximate entailment in quasimetric spaces
The logic LAE discussed in this paper is based on an approximate entailment relation. LAE generalises classical propositional logic to the effect that conclusions can be drawn with a quantified imprecision. To this end, properties are modelled by subsets of a distance space and statements are of the form that one property implies another property within a certain limit of tolerance. We adopt th...
متن کاملUncertain random logic and uncertain random entailment
Probabilistic logic and uncertain logic, as two branches of the multi-valued logic, have been proposed for dealing with knowledge with random factors and with human uncertainty, respectively. As a generalization, this paper proposes an uncertain random logic to deal with complex knowledge containing random factors and human uncertainty simultaneously, and derives a formula to calculate the trut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2023
ISSN: ['1465-363X', '0955-792X']
DOI: https://doi.org/10.1093/logcom/exac101